Improving the DISPGB Algorithm Using the Discriminant Ideal
نویسندگان
چکیده
In 1992, V. Weispfenning proved the existence of Comprehensive Gröbner Bases (CGB) and gave an algorithm for computing one. That algorithm was not very efficient and not canonical. Using his suggestions, A. Montes obtained in 2002 a more efficient algorithm (DISPGB) for Discussing Parametric Gröbner Bases. Inspired by its philosophy, V. Weispfenning defined, in 2002, how to obtain a Canonical Comprehensive Gröbner Basis (CCGB) for parametric polynomial ideals, and provided a constructive method. In this paper we use Weispfenning’s CCGB ideas to make substantial improvements on Montes’ DISPGB algorithm. It now includes rewriting of the discussion tree using the discriminant ideal and provides a compact and effective discussion. We also describe the new algorithms in the DPGB library containing the improved DISPGB as well as new routines for checking whether a given basis is a CGB or not, and for obtaining a CGB. Examples and tests are also provided. c © 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Improving Dispgb Algorithm Using the Discriminant Ideal *
In 1992, V. Weispfenning proved the existence of Comprehensive Gröbner Bases (CGB) and gave an algorithm to compute one. That algorithm was not very efficient and not canonical. Using his suggestions, A. Montes obtained in 2002 a more efficient algorithm (DISPGB) for Discussing Parametric Gröbner Bases. Inspired in its philosophy, V. Weispfenning defined, in 2002, how to obtain a Canonical Comp...
متن کامل2 9 Ja n 20 06 Canonical discussion of polynomial systems with parameters ∗
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Gröbner bases depending on the values of the parameters. An improvement using a discriminant ideal to rewrite the tree was described by Manubens and the author in 2005. In this paper we describe how to iterate the use ...
متن کامل6 Canonical discussion of polynomial systems with parameters ∗
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Gröbner bases depending on the values of the parameters. An improvement using a discriminant ideal to rewrite the tree was described by Manubens and the author in 2005. In this paper we describe how to iterate the use ...
متن کاملCaninical Discussion of Polynomial Systems with Parameters *
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Gröbner bases depending on the values of the parameters. An improvement using a discriminant ideal to rewrite the tree was described by Manubens and the author in 2005. In this paper we describe how to iterate the use ...
متن کاملApplying Buchberger's criteria on Montes's DisPGB algorithm
The concept of comprehensive Grobner bases was introduced by Weispfenning. Montes has proposed an efficient algorithm for computing these bases. But he has not explicitly used Buchberger's criteria in his algorithm. In this paper we prove that we can apply these criteria on Montes algorithm. We propose a modified version of Montes algorithm and evaluate its performance via some examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 41 شماره
صفحات -
تاریخ انتشار 2005